Counting Configurations in Designs
نویسندگان
چکیده
منابع مشابه
Counting Configurations in Designs
Given a t-(v, k, λ) design, form all of the subsets of the set of blocks. Partition this collection of configurations according to isomorphism and consider the cardinalities of the resulting isomorphism classes. Generalizing previous results for regular graphs and Steiner triple systems, we give linear equations relating these cardinalities. For any fixed choice of t and k, the coefficients in ...
متن کاملCounting Triangulations of Configurations
Calculating the number of Euclidean triangulations of a convex polygon P with vertices in a finite subset C ⊂ R2 containing all vertices of P seems to be difficult and has attracted some interest, both from an algorithmic and a theoretical point of view, see for instance [1], [2], [3], [4], [5], [7], [9], [10], [11]. The aim of this paper is to describe a class of configurations, convex near-go...
متن کاملDesigns and Configurations
A new class of designs which protect against quantum jumps, Des.
متن کاملForbidden configurations and Steiner designs
Let F be a (0, 1) matrix. A (0, 1) matrix M is said to have F as a configuration if there is a submatrix of M which is a row and column permutation of F . We say that a matrix M is simple if it has no repeated columns. For a given v ∈ N, we shall denote by forb(v,F) the maximum number of columns in a simple (0, 1) matrix with v rows for which F does not occur as a configuration. We say that a m...
متن کاملCounting Classes of Klondike Solitaire Configurations
Klondike Solitaire – also known as Patience – is a well-known single player card game. We studied several classes of Klondike Solitaire game configurations. We present a dynamic programming solution for counting the number of “unplayable” games. This method is extended for a subset of games which allow exactly one move. With an algorithm based on the inclusion-exclusion principle, symmetry elim...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Combinatorial Theory, Series A
سال: 2001
ISSN: 0097-3165
DOI: 10.1006/jcta.2001.3185